package xiaomin.demo.algorithm;

import Classic.*;
import leetcode.*;

public class application {
    public static void main(String[] args) {
        System.out.println("Hello World");
       // Lesson02.run();

//        Lesson03.save(2);
//        Lesson03.save(2);
//        Lesson03.save(1);
//        Lesson03.save(2);
//        Lesson03.test(4);

        //Lesson04.run(1);
        //Lesson04.run(2);
        //Lesson04.run(3);
        //Lesson04.run(4);
        //Lesson04.run(5);
        //Lesson04.run(6);

//        Lesson05.run();
//
//        Lesson06.run();

//        Lesson07.run();

//        Lesson08.run();

//        Lesson09.run();
//        Lesson10.run();

//        Lesson11.run();

//        int[] arr={3,2,1,2,7,3,8};
//
//        QSort.quickSort(arr,0,arr.length-1);
//
//        for(int a:arr){
//            System.out.println(a);
//        }

//        Lesson12.run();
//        Lesson13.run();

//        Lesson18.run();

//        Lesson24.run();

//        Lesson23.run();

//        Lesson25.run();

//        Test0003.run();

//        Demo001.run();
//        Demo002.run();
//        Demo003.run();
//        Demo004.run();

//        Demo005.run();
//        Demo006.run();
//        Demo007.run();

//        Lesson28.run();

//        new Test530().run();

//        Test0007.run();

//        Test0014.run();

//        System.out.println(new Test0020().isValid("]]"));
//        System.out.println(new Test0035().searchInsert(new int[]{1,3,4,6},5));
//          new Test0070().climbStairs(44);


//          int [] arr={722,634,-504,-379,163,-613,-842,-578,750,951,-158,30,-238,-392,-487,-797,-157,-374,999,-5,-521,-879,-858,382,626,803,-347,903,-205,57,-342,186,-736,17,83,726,-960,343,-984,937,-758,-122,577,-595,-544,-559,903,-183,192,825,368,-674,57,-959,884,29,-681,-339,582,969,-95,-455,-275,205,-548,79,258,35,233,203,20,-936,878,-868,-458,-882,867,-664,-892,-687,322,844,-745,447,-909,-586,69,-88,88,445,-553,-666,130,-640,-918,-7,-420,-368,250,-786};
//          new Test0628().maximumProduct(arr);

//          int [] arr1={40,10,20,30};
//          new Test1331().arrayRankTransform(arr1);
//            int [] arr2={1,2,2,3,1};
//            new Test0697().findShortestSubArray(arr2);
            int [] arr3={3,19,18,2,9,4,7,11,15,7,14,10,11,9,8,5,4,14,11,4,16,3,13,14,14,15,8,19,3,5,20,15,14,10,16,11,17,20,11,20,15,3,20,5,12,2,15,12,14,16,20,17,15,8,18,9,8,5,12,3,5,15,14,10,2,20,20,3,13,9,1,3,16,18,14,16,13,9,18,13,9,3,5,19};
            new Test1394().findLucky(arr3);
    }
}
